Symbolic Computation of Lax Pairs of Partial Difference Equations using Consistency Around the Cube
نویسندگان
چکیده
منابع مشابه
Symbolic Computation of Lax Pairs of Partial Difference Equations using Consistency Around the Cube
A three-step method due to Nijhoff and Bobenko & Suris to derive a Lax pair for scalar partial difference equations (P Es) is reviewed. The method assumes that the P Es are defined on a quadrilateral, and consistent around the cube. Next, the method is extended to systems of P Es where one has to carefully account for equations defined on edges of the quadrilateral. Lax pairs are presented for ...
متن کاملOptimised finite difference computation from symbolic equations
Domain-specific high-productivity environments are playing an increasingly important role in scientific computing due to the levels of abstraction and automation they provide. In this paper we introduce Devito, an opensource domain-specific framework for solving partial differential equations from symbolic problem definitions by the finite difference method. We highlight the generation and auto...
متن کاملSymbolic computation of the Duggal transform
Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...
متن کاملassessment of the efficiency of s.p.g.c refineries using network dea
data envelopment analysis (dea) is a powerful tool for measuring relative efficiency of organizational units referred to as decision making units (dmus). in most cases dmus have network structures with internal linking activities. traditional dea models, however, consider dmus as black boxes with no regard to their linking activities and therefore do not provide decision makers with the reasons...
Symbolic Computation of Recursion Operators for Nonlinear Differential-Difference equations
An algorithm for the symbolic computation of recursion operators for systems of nonlinear differential-difference equations (DDEs) is presented. Recursion operators allow one to generate an infinite sequence of generalized symmetries. The existence of a recursion operator therefore guarantees the complete integrability of the DDE. The algorithm is based in part on the concept of dilation invari...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Foundations of Computational Mathematics
سال: 2012
ISSN: 1615-3375,1615-3383
DOI: 10.1007/s10208-012-9133-9